Unrelated parallel machine scheduling with new criteria: Complexity and models

In this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent machine-dependent setup times is studied. This can be found in various manufacturing contexts, particular workshops of wafer facilities. Three different criteria are defined analyzed: The number products completed before the end given time horizon, weighted sum completion resource moves. first criterion maximized, while two others minimized. third not classical theory, but justified industrial settings. complexity each new characterized. Integer linear programming models also proposed numerical experiments conducted to analyze their behavior.